Proof of Peterson’s algorithm for mutual exclusion∗
نویسندگان
چکیده
4 Checking the model 6 4.1 Validation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 4.2 Mutual exclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.3 Liveness . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 4.4 Freedom from starvation . . . . . . . . . . . . . . . . . . . . . . . 8 4.5 Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
منابع مشابه
Peterson’s Algorithm in Isabelle/HOL
Peterson’s algorithm [Pet81] is designed to ensure mutual exclusion between two processes without any special hardware support. Peterson’s algorithm has been formalised and verified several times. Although the algorithm is essentially finite state, and therefore susceptible to model checking, we provide an invariant style proof. Invariant style proofs illustrate techniques that are usable for p...
متن کاملA Family of 2-process Mutual Exclusion Algorithms
In Peterson [1981], Peterson suggested a mutual exclusion algorithm. The algorithm, though simple in structure, seems quite involved when a formal proof is attempted. We suggest how Peterson’s algorithm and some similar algorithms may be derived by starting with a highlevel algorithm and refining it. The refinement consists of implementing a complex shared data structure by elementary data stru...
متن کاملThe assertional versus Tarskian methods
In this lecture we analyze Peterson’s well known two-process criticalsection protocol [3] and prove that the mutual exclusion property holds. Our main aim is to explain two approaches by which the correctness of this protocol can be established. The first is the assertional method of proof which is the standard approach to concurrency. This approach uses the notions of global states, steps and ...
متن کاملTLA + Proofs
TLA is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA proofs and check them with TLAPS, the TLA Proof System. We use Peterson’s mutual exclusion algorithm as a simple example to describe the features of TLAPS and show how it and the Toolbox (an IDE for TLA) help users to manage large, complex pro...
متن کاملA mutual exclusion algorithm with optimally bounded bypasses
Peterson’s algorithm [G.L. Peterson, Myths about the mutual exclusion problem, Inform. Process. Lett. 12 (3) (1981) 115–116] for mutual exclusion has been widely studied for its elegance and simplicity. In Peterson’s algorithm, each process has to cross n− 1 stages to access the shared resource irrespective of the contention for the shared resource at that time, and allows unbounded bypasses. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017